Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
نویسندگان
چکیده
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by local search using specific mutation operators. Thus, only valid (partial) timetables are generated which fulfill all hard constraints.
منابع مشابه
Universal Method for Solving Timetabling Problems Based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and employs tabu search to speed up the solution finding...
متن کاملHybrid artificial intelligence technique for solving large, highly constrained timetabling problems
Timetabling problems are often hard and time-consuming to solve. Profits from full automatization of this process can be invaluable. Although over the years many solutions have been proposed, most of the methods concern only one problem instance or class. This paper describes a possibly universal method for solving large, highly constrained timetabling problems from different areas. The solutio...
متن کاملAutomatic Timetabling Using Artificial Immune System
University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university tim...
متن کاملThe Solution of Real Instances of the Timetabling Problem
This paper describes a computer program for high school timetabling which has completely solved an instance taken without simplification from a large and tightly constrained high school. A timetable specification language allows the program to handle the many idiosyncratic constraints of such instances in a uniform way. New algorithms are introduced which attack the problem more intelligently t...
متن کاملA Standard Framework for Timetabling Problems
When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem. One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures p...
متن کامل